#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL num[maxn],c1[maxn],c2[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n;cin>>n;
    for(LL i=0;i<n+10;i++) num[i]=c1[i]=c2[i]=0;
    for(LL i=1;i<=n;i++){
        cin>>num[i];
    }
    for(LL i=1;i<=n;i++){
        cin>>c1[i];
    }
    for(LL i=1;i<=n;i++){
        cin>>c2[i];
    }
    LL sum=0;LL ans=abs(c1[2]-c2[2])+1;
    for(LL i=2;i<=n;i++){
        LL temp=ans+num[i];
        sum=max(sum,temp);
        if(c1[i+1]==c2[i+1]) ans=1;
        else if(c1[i+1]<c2[i+1]){
            ans=max(c2[i+1]-c1[i+1]+1,ans+1+c1[i+1]-c2[i+1]+num[i]);
        }
        else ans=max(c1[i+1]-c2[i+1]+1,ans+c2[i+1]-c1[i+1]+num[i]+1);
    }
    cout<<sum<<endl;
  }
return 0;
}
